A remark on polyconvex envelopes of radially symmetric functions in dimension 2 × 2
نویسندگان
چکیده
منابع مشابه
The 2-dimension of a Tree
Let $x$ and $y$ be two distinct vertices in a connected graph $G$. The $x,y$-location of a vertex $w$ is the ordered pair of distances from $w$ to $x$ and $y$, that is, the ordered pair $(d(x,w), d(y,w))$. A set of vertices $W$ in $G$ is $x,y$-located if any two vertices in $W$ have distinct $x,y$-location.A set $W$ of vertices in $G$ is 2-located if it is $x,y$-located, for some distinct...
متن کاملReliable and Efficient Approximation of Polyconvex Envelopes
An iterative algorithm that approximates the polyconvex envelope f pc of a given function f : R → R, i.e. the largest function below f which is convex in all minors, is established. A rigorous error analysis with a focus on reliability and optimal orders of convergence, an efficient strategy that reduces the large number of unknowns, as well as numerical experiments are presented.
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
A remark on the (2, 2)-domination number
A subset D of the vertex set of a graph G is a (k, p)-dominating set if every vertex v ∈ V (G) \ D is within distance k to at least p vertices in D. The parameter γk,p(G) denotes the minimum cardinality of a (k, p)-dominating set of G. In 1994, Bean, Henning and Swart posed the conjecture that γk,p(G) ≤ p p+k n(G) for any graph G with δk(G) ≥ k + p − 1, where the latter means that every vertex ...
متن کاملA Remark on Random 2-SAT
It is known that almost all 2-CNF-formulas where the number of clauses is n (1 ? ") ; " > 0 a constant ; n the number of variables are satissable. For n (1 + ") they are shown to be unsatissable. We strengthen the rst result and show that for each " = "(n) (1 ln n) 1 2 (hence " may approach 0) the rst of the results above still holds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1997
ISSN: 0862-7940,1572-9109
DOI: 10.1023/a:1022417621327